Papers with discontinuous constituent parsing
Improving the Extraction of Supertags for Constituency Parsing with Linear Context-Free Rewriting Systems (2022.findings-emnlp)
Copied to clipboard
| Challenge: | a new approach to parsing discontinuous constituency structures uses supertags to improve parsability . traditional approaches use grammar formalisms to model hierarchies of noncontiguous phrases . but supertags are still useful for analyzing these grammars and parsers . |
| Approach: | They propose to reformulate and parameterize extraction process for LCFRS supertags to improve parsing quality. |
| Outcome: | The proposed method improves the quality and speed of parsing with supertags over the previous method. |
Generic refinement of expressive grammar formalisms with an application to discontinuous constituent parsing (C18-1)
Copied to clipboard
| Challenge: | a split/merge algorithm for interpreted regular tree grammars is a generalization of Petrov et al. (2006) . |
| Approach: | They propose to use a split/merge algorithm for interpreted regular tree grammars to refine a large class of grammar formalisms. |
| Outcome: | The proposed algorithm captures a large class of grammar formalisms and is able to refine natural sets of nonterminals. |